Semantic Place Labeling Using a Probabilistic Decision List of AdaBoost Classifiers

نویسندگان

  • Symone G. Soares
  • Rui Araújo
چکیده

The success of mobile robots relies on the ability to extract from the environment additional information beyond simple spatial relations. In particular, mobile robots need to have semantic information about the entities in the environment such as the type or the name of places or objects. This work addresses the problem of classifying places (room, corridor or doorway) using mobile robots equipped with a laser range scanner. This paper compares the results of several AdaBoost algorithms (Viola-Jones AdaBoost, Gentle AdaBoost, Modest AdaBoost and Generalized AdaBoost for the place categorization) to train a set of classifiers and discusses these solutions. Since the problem is multi-class and these AdaBoosts provide only binary outputs, the AdaBoosts are arranged into Probabilistic Decision Lists (PDL), where each AdaBoost of the list gives a confidence value of each class. Then, Probabilistic Relaxation Labeling (PRL) is performed to smooth the classification results. Moreover, heuristics for removing incorrect regions are proposed to reduce the classification error. Experimental results suggest that PDL can be extended to several binary classifiers and show that PRL improves significantly the classification rates of the classifiers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Theory of Probabilistic Boosting, Decision Trees and Matryoshki

We present a theory of boosting probabilistic classifiers. We place ourselves in the situation of a user who only provides a stopping parameter and a probabilistic weak learner/classifier and compare three types of boosting algorithms: probabilistic Adaboost, decision tree, and tree of trees of ... of trees, which we call matryoshka. “Nested tree,” “embedded tree” and “recursive tree” are also ...

متن کامل

Semantic Role Labeling Using Complete Syntactic Analysis

In this paper we introduce a semantic role labeling system constructed on top of the full syntactic analysis of text. The labeling problem is modeled using a rich set of lexical, syntactic, and semantic attributes and learned using one-versus-all AdaBoost classifiers. Our results indicate that even a simple approach that assumes that each semantic argument maps into exactly one syntactic phrase...

متن کامل

Using AdaBoost for Place Labeling and Topological Map Building

Indoor environments can typically be divided into places with different functionalities like corridors, kitchens, offices, or seminar rooms. We believe that the ability to learn such semantic categories from sensor data or in maps enables a mobile robot to more efficiently accomplish a variety of tasks such as human-robot interaction, path-planning, exploration, or localization. In this work, w...

متن کامل

ADABOOST ENSEMBLE ALGORITHMS FOR BREAST CANCER CLASSIFICATION

With an advance in technologies, different tumor features have been collected for Breast Cancer (BC) diagnosis, processing of dealing with large data set suffers some challenges which include high storage capacity and time require for accessing and processing. The objective of this paper is to classify BC based on the extracted tumor features. To extract useful information and diagnose the tumo...

متن کامل

Fast classification using sparse decision DAGs

In this paper we propose an algorithm that builds sparse decision DAGs (directed acyclic graphs) from a list of base classifiers provided by an external learning method such as AdaBoost. The basic idea is to cast the DAG design task as a Markov decision process. Each instance can decide to use or to skip each base classifier, based on the current state of the classifier being built. The result ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013